Optimal Linear Codes over Z

نویسندگان

  • Steven T. Dougherty
  • T. Aaron Gulliver
  • Young Ho Park
  • John N. C. Wong
  • N. C. WONG
چکیده

We examine the main linear coding theory problem and study the structure of optimal linear codes over the ring Zm. We derive bounds on the maximum Hamming weight of these codes. We give bounds on the best linear codes over Z8 and Z9 of lengths up to 6. We determine the minimum distances of optimal linear codes over Z4 for lengths up to 7. Some examples of optimal codes are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

(1 + u)-Constacyclic codes over Z4 + uZ4

Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, (1 + u)-constacyclic codes over Z 4 + uZ 4 of any length are studied. A new Gray map between Z 4 + uZ 4 and Z 4 (4) is defined. By means of this map, it is shown that the Z 4 Gray image of a (1 + u)-constacyclic code of length n over ...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Some results of linear codes over the ring $\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$

Abstract: In this paper, we mainly study the theory of linear codes over the ring R = Z4 + uZ4 + vZ4 + uvZ4. By the Chinese Remainder Theorem, we have R is isomorphic to the direct sum of four rings Z4. We define a Gray map Φ from R n to Z 4 , which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over Z4. Furthermore, we study the MacWilliams identities of ...

متن کامل

$(1+2u)$-constacyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$

Let $R=\mathbb{Z}_4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u^2=0$. In the present paper, we introduce a new Gray map from $R^n$ to $\mathbb{Z}_{4}^{2n}.$ We study $(1+2u)$-constacyclic codes over $R$ of odd lengths with the help of cyclic codes over $R$. It is proved that the Gray image of $(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007